Pairwise “Orthogonal generalized room squares” and equidistant permutation arrays
نویسندگان
چکیده
منابع مشابه
On Maximal Equidistant Permutation Arrays
An equidistant permutation array A(r, I ; u ) is a t' x r array defined on a symbol set V such that each row of the array is a permutation of the symbol set V and any two distinct rows of A have precisely A common column entries. Given r and i.. one can ask for the largest u such that an A(r, 2.; v) exists or find the smallest v such that an A(r, I; u ) exists which cannot be extended to an A(r...
متن کاملModelling Equidistant Frequency Permutation Arrays in Constraints
Equidistant Frequency Permutation Arrays are combinatorial objects of interest in coding theory. A frequency permutation array is a type of constant composition code in which each symbol occurs the same number of times in each codeword. The problem is to find a set of codewords such that any pair of codewords are a given uniform Hamming distance apart. The equidistant case is of special interes...
متن کاملEquidistant frequency permutation arrays and related constant composition codes
This paper introduces and studies the notion of an equidistant frequency permutation array (EFPA). An EFPA of length n = mλ, distance d and size v is defined to be a v×n array T such that 1) each row is a multipermutation on a multiset of m symbols, each repeated with frequency λ, and 2) the Hamming distance between any two distinct rows of T is precisely d. Such an array generalizes the well-s...
متن کاملGeneralized resolution for orthogonal arrays
The generalized word length pattern of an orthogonal array allows a ranking of orthogonal arrays in terms of the generalized minimum aberration criterion (Xu and Wu [Ann. Statist. 29 (2001) 1066–1077]). We provide a statistical interpretation for the number of shortest words of an orthogonal array in terms of sums of R2 values (based on orthogonal coding) or sums of squared canonical correlatio...
متن کاملNew bounds for pairwise orthogonal diagonal Latin squares
A diagonal Latin square is a Latin square whose main diagonal and back diagonal are both transversals. Let dr be the least integer such that for all n > dr there exist r pairwise orthogonal diagonal Latin squares of order n. In a previous paper Wallis and Zhu gave several bounds on the dr. In this paper we shall present some constructions of pairwise orthogonal diagonal Latin squares and conseq...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal of Combinatorial Theory, Series A
سال: 1978
ISSN: 0097-3165
DOI: 10.1016/0097-3165(78)90037-7